The capacity region of broadcast channels with intersymbol interference and colored Gaussian noise

نویسندگان

  • Andrea J. Goldsmith
  • Michelle Effros
چکیده

We derive the capacity region for a broadcast channel with intersymbol interference (ISI) and colored Gaussian noise under an input power constraint. The region is obtained by first defining a similar channel model, the circular broadcast channel, which can be decomposed into a set of parallel degraded broadcast channels. The capacity region for parallel degraded broadcast channels is known. We then show that the capacity region of the original broadcast channel equals that of the circular broadcast channel in the limit of infinite block length, and we obtain an explicit formula for the resulting capacity region. The coding strategy used to achieve each point on the convex hull of the capacity region uses superposition coding on some or all of the parallel channels and dedicated transmission on the others. The optimal power allocation for any point in the capacity region is obtained via a multilevel water-filling. We derive this optimal power allocation and the resulting capacity region for several broadcast channel models.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Gaussian Z Channel with Intersymbol Interference

In this paper, we derive a capacity inner bound for a synchronous Gaussian Z channel with intersymbol interference (ISI) under input power constraints. This is done by converting the original channel model into an n-block memoryless circular Gaussian Z channel (n-CGZC) and successively decomposing the n-block memoryless channel into a series of independent parallel channels in the frequency dom...

متن کامل

The Capacity Region of Gaussian Broadcast Channels with Intersymbol Interference

We derive the two-user capacity region with and without common information for a Gaussian broadcast channel with intersymbol interference, assuming colored Gaussian noise and an input power constraint. The proof is achieved by rst deening a similar channel model, the circular broadcast channel, which can be decomposed into a set of parallel degraded broadcast channels. The capacity region for p...

متن کامل

Linear models and capacity bounds for continuous phase modulation

Abstract—We derive upper bounds on the capacity of an additive Gaussian noise channel with continuous phase modulation (CPM). We propose an MMSE approximation to Laurent’s linear decomposition using an arbitrary number of filtered, linearly modulated pulses. Using this linear modulation structure, we derive capacity bounds for both white and colored noise channels with CPM modulation by showing...

متن کامل

Gaussian multiaccess channels with ISI: Capacity region and multiuser water-filling

The capacity region of a two-user Gaussian multiaccess channel with intersymbol interference (ISI), where the inputs pass through respective linear systems and are then superimposed before being corrupted by an additive Gaussian noise process, is found. A novel geometrical method is given to obtain the optimal input power spectral densities and the capacity region. This method can be viewed as ...

متن کامل

Capacity Region of the Compound Multiple Access Channels with Common Message and in the Presence of Intersymbol Interference

The capacity region of a two-user linear Gaussian compound Multiple Access Channel with common message (CMACC) and intersymbol interference (ISI) under an input power constraint is derived. To obtain the capacity region we first convert the channel to its equivalent memoryless one by defining an n-block memoryless circular Gaussian CMACC model. We then make use of the discrete Fourier transform...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 47  شماره 

صفحات  -

تاریخ انتشار 2001